منابع مشابه
Counting monotonic subsequences in a data stream
We prove Ω(n) deterministic lower bounds for any streaming algorithm that exactly computes the number of inversions (2-dec-count) in a data stream of t elements where each element comes from [n] and t ≥ Ω(n). The proof uses a reduction argument and utilizes communication lower bounds for computation of disjointness. Our second result is Ω(n) lower bound on any algorithm that correctly computes ...
متن کاملMonotonic subsequences in dimensions higher than one
The 1935 result of Erdős and Szekeres that any sequence of ≥ n +1 real numbers contains a monotonic subsequence of ≥ n+ 1 terms has stimulated extensive further research, including a paper of J. B. Kruskal that defined an extension of monotonicity for higher dimensions. This paper provides a proof of a weakened form of Kruskal’s conjecture for 2-dimensional Euclidean space by showing that there...
متن کاملMonotonic and Dual Monotonic Language
Monotonic and dual monotonic language learning from positive as well as from positive and negative examples is investigated. Three di erent notions of monotonicity are considered. Each of them re ects an alternative formalization of the requirement that the learner has to produce better and better generalizations when fed more and more data on the concept to be learned. Strong{monotonicity abso...
متن کاملHeapable Sequences and Subsequences
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a previously placed number. In this paper we consider a variety of problems related to heapable sequences and subsequences that do not appear to have been studied previously. Our motivation for introducing these conc...
متن کاملAll Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common subsequence. This measure advocates using the length of the longest common subsequence as an indication of similarity between sequences, but ignores information contained in the second, third, ..., longest subsequences. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1953
ISSN: 0002-9939
DOI: 10.2307/2031803